Worst Cases for Correct Rounding of the Elementary Functions in Double Precision
نویسندگان
چکیده
We give the results of our search for the worst cases for correct rounding of themajor elementary functions in double precision floating-point arithmetic. These results allow the design of reasonably fast routines that will compute these functions with correct rounding, at least in some interval, for any of the four rounding modes specified by the IEEE-754 standard. They will also allow one to easily test libraries that are claimed to provide correctly rounded functions.
منابع مشابه
Fast correct rounding of elementary functions in double precision using double-extended arithmetic
This article shows that IEEE-754 double-precision correct rounding of the most common elementary functions (exp/log, trigonometric and hyperbolic) is achievable on current processors using only double-double-extended arithmetic. This allows to improve by several orders of magnitude the worst case performance of a correctly-rounded mathematical library, compared to the current state of the art. ...
متن کاملWorst Cases for the Exponential Function in the IEEE 754r decimal64 Format
We searched for the worst cases for correct rounding of the exponential function in the IEEE 754r decimal64 format, and computed all the bad cases whose distance from a breakpoint (for all rounding modes) is less than 10 ulp, and we give the worst ones. In particular, the worst case for |x| ≥ 3 × 10 is exp(9.407822313572878 × 10) = 1.098645682066338 5 0000000000000000 278 . . .. This work can b...
متن کاملAn efficient rounding boundary test for pow(x,y) in double precision
The correct rounding of the function pow : (x, y) 7→ x is currently based on Ziv’s iterative approximation process. In order to ensure its termination, cases when x falls on a rounding boundary must be filtered out. Such rounding boundaries are floating-point numbers and midpoints between two consecutive floating-point numbers. Detecting rounding boundaries for pow is a difficult problem. Previ...
متن کاملWorst Cases and Lattice Reduction
We propose a new algorithm to find worst cases for correct rounding of an analytic function. We first reduce this problem to the real small value problem — i.e. for polynomials with real coefficients. Then we show that this second problem can be solved efficiently, by extending Coppersmith’s work on the integer small value problem — for polynomials with integer coefficients — using lattice redu...
متن کاملTowards Correctly Rounded Transcendentals
The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the double-precision fo...
متن کامل